Muller Message-Passing Automata and Logics
نویسندگان
چکیده
We study nonterminating message-passing automata whose behavior is described by infinite message sequence charts. As a first result, we show that Muller, Büchi, and terminationdetecting Muller acceptance are equivalent for these devices. To describe the expressive power of these automata, we give a logical characterization. More precisely, we show that they have the same expressive power as the existential fragment of a monadic secondorder logic featuring a first-order quantifier to express that there are infinitely many elements satisfying some property. This result is based on Vinner’s extension of the classical Ehrenfeucht-Fraı̈ssé game to cope with the infinity quantifier.
منابع مشابه
Benedikt Bollig and Dietrich Kuske Distributed Muller Automata and Logics Research Report LSV - 06 - 11 May 2006
We consider Muller asynchronous cellular automata running on infinite dags over distributed alphabets. We show that they have the same expressive power as the existential fragment of a monadic secondorder logic featuring a first-order quantifier to express that there are infinitely many elements satisfying some property. Our result is based on an extension of the classical Ehrenfeucht-Fräıssé g...
متن کاملAutomata and Logics for Concurrent Systems: Five Models in Five Pages
We survey various automata models of concurrent systems and their connection with monadic second-order logic: finite automata, class memory automata, nested-word automata, asynchronous automata, and message-passing automata.
متن کاملAutomata and logics for message sequence charts
A message-passing automaton is an abstract model for the implementation of a distributed system whose components communicate via message exchange and thereby define a collection of communication scenarios called message sequence charts. In this thesis, we study several variants of message-passing automata in a unifying framework. We classify their expressiveness in terms of state-space properti...
متن کاملWeighted automata and weighted logics on innite words
We introduce weighted automata over in nite words with Muller acceptance condition and we show that their behaviors coincide with the semantics of weighted restricted MSO-sentences. Furthermore, we establish an equivalence property of weighted Muller and weighted Büchi automata over certain semirings. Keywords: Weighted logics, Weighted Muller automata, In nitary formal power series, Weighted B...
متن کاملGossiping in Message-Passing Systems
We study the gossip problem in a message-passing environment: When a process receives a message, it has to decide whether the sender has more recent information on other processes than itself. This problem is at the heart of many distributed algorithms, and it is tightly related to questions from formal methods concerning the expressive power of distributed automata. We provide a non-determinis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 206 شماره
صفحات -
تاریخ انتشار 2007